Fast Computation of Tukey Trimmed Regions and Median in Dimension p > 2
نویسندگان
چکیده
منابع مشابه
Tukey Depth-based Multivariate Trimmed Means
We investigate the asymptotic behavior of two types of Tukey depth-based multivariate trimmed means. Sufficient conditions for asymptotic normality of these location estimators are given. Two approaches to trimming are distinguished and central limit theorems are derived for each one. Asymptotic normality is proved using Hadamard differentiability of the location functionals. In the one-dimensi...
متن کاملdedekind modules and dimension of modules
در این پایان نامه، در ابتدا برای مدول ها روی دامنه های پروفر شرایط معادل به دست آورده ایم و خواصی از ددکیند مدول ها روی دامنه های پروفر مشخص کرده ایم. در ادامه برای ددکیند مدول های با تولید متناهی روی حلقه های به طور صحیح بسته شرایط معادل به دست آورده ایم و ددکیند مدول های ضربی را مشخص کرده ایم. گزاره هایی در مورد بعد ددکیند مدول ها بیان کرده ایم. در پایان، قضایای lying over و going down را برا...
15 صفحه اولFast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population’s center, since the former is more robust. But in general, computing the median is considerably slower than the standard mean calculation, and a fast median algorithm is of interest. The fastest existing algorithm is quickselect. We investigate a novel algorithm binmedian, which has O(n) average complex...
متن کاملMultivariate risks and depth-trimmed regions
We describe a general framework for measuring risks, where the risk measure takes values in an abstract cone. It is shown that this approach naturally includes the classical risk measures and set-valued risk measures and yields a natural definition of vector-valued risk measures. Several main constructions of risk measures are described in this abstract axiomatic framework. It is shown that the...
متن کاملThe Cooley - Tukey Fast Fourier Transform Algorithm ∗
The publication by Cooley and Tukey [5] in 1965 of an e cient algorithm for the calculation of the DFT was a major turning point in the development of digital signal processing. During the ve or so years that followed, various extensions and modi cations were made to the original algorithm [6]. By the early 1970's the practical programs were basically in the form used today. The standard develo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2019
ISSN: 1061-8600,1537-2715
DOI: 10.1080/10618600.2018.1546595